#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
using namespace std;

int n,a[100005],m[100005],cnt,k;

int main(){
    //cin.tie(0);
    //cout.tie(0);
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    sort(a+1,a+n+1);
    a[0]=2000000;
    cnt=0;
    for(int i=1;i<=n;i++){
        if(a[i-1]!=a[i]){
            cnt++;
            m[cnt]=0;
        }
        m[cnt]++;
    }
    for(int i=1;i<cnt;i++){
        if(m[i+1]<m[i]){
            m[i+1]=m[i];
        }
    }
    cout<<m[cnt];
	return 0;
}
